Limitantes de Desempenho de Fila para Tráfego Multifractal de Redes

In this paper, we investigate the queueing behavior of multifractal traffic flows. Initially, we derive a global scaling parameter for multifractal processes. Next, we obtain a global scaling based expression for the effective bandwidth of multifractal flows. Relating this effective bandwidth estimate to the statistical network calculus, we propose performance bounds for high-speed networks. Our performance bound estimation approach is evaluated by simulations with Internet and Ethernet traffic traces, verifying its efficiency in capturing byte loss probability and mean buffer occupation. We verify that the proposed byte loss probability bound is tighter than that given by the Large Deviations Theory.